Run-to-run Optimization via Control of Generalized Constraints
نویسندگان
چکیده
Run-to-run optimization methodologies exploit the repetitive nature of batch processes to determine the optimal operating policy in the presence of uncertainty. In this paper, a parsimonious parameterization of the inputs is used and the decision variables of the parameterization are updated on a run-to-run basis using a feedback control scheme which tracks signals that are invariant under uncertainty. In this run-to-run framework, terminal constraints of the optimization problem and cost sensitivities constitute the invariant signals. The methodology is adapted to improve the cost function from batch to batch without constraint violation.
منابع مشابه
Run-to-run Optimization via Constraint Control
Run-to-run optimization methodologies exploit the repetitive nature of batch processes to find the optimal operating policy in the presence of uncertainty. For the class of batch optimization problems where the solution is determined by terminal constraints, the update of the decision variables towards their optimal values is realized using a constraint control scheme. The methodology is adapte...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملA New Optimization Model for Designing Acceptance Sampling Plan Based on Run Length of Conforming Items
The purpose of this article is to present an optimization model for designing an acceptance sampling plan based on cumulative sum of run length of conforming items. The objective is to minimize the total loss including both the producer and consumer losses. The concept of minimum angle method is applied to consider producer and consumer risks in the optimization model. Also the average number o...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملCuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012